- octree node
- узел октадерева
English-Russian dictionary of mechanical engineering and automation. - RUSSO. B.S. Voskoboinikov, V.L. Mitrovich. 2003.
octree node
Смотреть что такое "octree node" в других словарях:
Octree — Left: Recursive subdivision of a cube into octants. Right: The corresponding octree. An octree is a tree data structure in which each internal node has exactly eight children. Octrees are most often used to partition a three dimensional space by… … Wikipedia
Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… … Wikipedia
Linear octrees — An octree is said to be complete if every internal node has exactly 8 child nodes. If the maximum permissible depth of an octree is fixed a priori, then it is sufficient to store the complete list of leaf nodes of the octree. Such a… … Wikipedia
Quadtree — A quadtree is a tree data structure in which each internal node has up to four children. Quadtrees are most often used to partition a two dimensional space by recursively subdividing it into four quadrants or regions. The regions may be square or … Wikipedia
Октодерево — Слева: Рекурсивное разделение куба на октанты. Справа: Соответствующее октодерево … Википедия
Cube 2: Sauerbraten — This article is about the game. For the food item, see Sauerbraten. Cube 2: Sauerbraten Developer(s) Wouter Aardappel van Oortmerssen, Lee eihrul Salzman, Mike Gilt Dys … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Sauerbraten (video game) — Infobox VG title = Sauerbraten developer = Lee Salzman, Wouter van Oortmerssen, Mike Dysart, Robert Pointon [cite web | year=2008 | title=Sauerbraten Credits/Authors | url=http://sauerbraten.org/README.html#credits slash authors |… … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
T-tree — In computer science a T tree is a type of binary tree data structure that is used by main memory databases, such as DataBlitz, e X treme DB, MySQL Cluster, Oracle TimesTen and [http://www.kairosdbms.com Kairos] [http://www.emware.co.kr… … Wikipedia
Красно-чёрное дерево — Тип дерево поиска Изобретено в 1972 году Изобретено Рудольф Байер Временная сложность в О символике В среднем В худшем случае Расход памяти O(n) O(n) Поиск O(log n) O(log n) Вставка O(log n) O(log n) Удаление O(log n) O(log n) Красно чёрное… … Википедия
